منابع مشابه
Ranking via Arrow-Debreu Equilibrium
In this paper, we establish a connection between ranking theory and general equilibrium theory. First of all, we show that the ranking vector of PageRank or Invariant method is precisely the equilibrium of a special Cobb-Douglas market. This gives a natural economic interpretation for the PageRank or Invariant method. Furthermore, we propose a new ranking method, the CES ranking, which is minim...
متن کاملLinear Arrow-Debreu market equilibrium
We study the linear Arrow-Debreu’s model and derive a fix point method to find the market equilibrium. The convergence of this method is proved, while the speed is unknown. Besides that, properties about utility distribution and the partition of buyers are also studied. I. PROBLEM DEFINITION The problems of market equilibrium were initially studied in the domain of mathematical economics. We st...
متن کاملA path to the Arrow-Debreu competitive market equilibrium
We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of them have the arithmetic operation complexity bound of O(n log(1/2)) for computing an 2-equilibrium solution. If the problem data are rational numbers and their bit-length is L, then the bound to generate an exact solut...
متن کاملNoisy Arrow - Debreu Equilibria ∗
I develop a noisy rational expectations equilibrium model with a continuum of states and a full set of options that render the market complete. I show a major difference in equilibrium behavior between models with constant absolute risk aversion (CARA) and non-CARA preferences. First, when informed traders have non-CARA preferences, all equilibria are fully revealing, independent of the amount ...
متن کاملYe A Path to the Arrow - Debreu Competitive Market Equilibrium
We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of them have the arithmetic operation complexity bound of O(n log(1/2)) for computing an 2-equilibrium solution. If the problem data are rational numbers and their bit-length is L, then the bound to generate an exact solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2012
ISSN: 1556-5068
DOI: 10.2139/ssrn.2013712